Metaheuristics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Metaheuristics

Metaheuristic parallel search methods { tabu search, simulated annealing and genetic algorithms, essentially { are reviewed, classi ed and examined not according to particular methodological characteristics, but following the unifying approach of the level of parallelization. It is hoped that by examining the commonalities among parallel implementations across the eld of metaheuristics, insight...

متن کامل

’Simple’ Metaheuristics

Define the problem Formulate clearly the problem State the combinatorial hardness of the problem Model the problem and recognize possible similar problems Search in the literature (or the Internet) for: complexity results (is the problem NP-hard?) solution algorithms for the original problem solution algorithms for the simplified problem Design and Implementation Experimentation configuring tun...

متن کامل

Metaheuristics 1

A metaheuristic is a high-level problem-independent algorithmic framework that provides a set of guidelines or strategies to develop heuristic optimization algorithms (Sörensen and Glover, To appear). Notable examples of metaheuristics include genetic/evolutionary algorithms, tabu search, simulated annealing, and ant colony optimization, although many more exist. A problem-specific implementati...

متن کامل

Complex metaheuristics

Complexity is a prevalent feature of numerous natural and artificial systems and as such has attracted much scientific interest in the last decades. The pursuit of computational tools capable of analyzing, modeling or designing systems exhibiting this complex nature –in which the properties of the system are not evident at the bottom level but emerge from its global structure– is a major issue....

متن کامل

Metaheuristics in Combinatorial Optimization

The emergence of metaheuristics for solving diÆcult combinatorial optimization problems is one of the most notable achievements of the last two decades in operations research. This paper provides an account of the most recent developments in the eld and identi es some common issues and trends. Examples of applications are also reported for vehicle routing and scheduling problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scholarpedia

سال: 2015

ISSN: 1941-6016

DOI: 10.4249/scholarpedia.6532